一种改进的网格数据保持梯度滤波方法

 基于网格数据滤波的基本思想，针对杨高印提出的小子域滤波法存在子域划分重心不稳的问题，本文提出了新的子域划分方法，即通过考察滤波窗口内数据的数值分布或梯度变化情况，在充分考虑子域划分对称性的基础上，采用对称子域的均方根误差或平均梯度大小差值为判别指标确定数据变化的主梯度方向，并用此判别指标代替数据变化平缓系数判别指标，在滤波输出的取值上考虑数据变化的梯度方向上的两个相对称子域对输出的贡献大小进行加权平均，使滤波输出结果更稳定。通过数据试算，表明网格数据滤波法输出结果更加合理、稳健。     

Nonlinear filtering structure for image smoothing in mixed-noise environments

This paper introduces a new nonlinear filtering structure for filtering image data that have been corrupted by both impulsive and nonimpulsive additive noise. Like other nonlinear filters, the proposed filtering structure uses order-statistic operations to remove the effects of the impulsive noise. Unlike other filters, however, nonimpulsive noise is smoothed by using a maximum a posteriori estimation criterion. The prior model for the image is a novel Markov random-field model that models image edges so that they are accurately estimated while additive Gaussian noise is smoothed. The Markov random-field-based prior is chosen such that the filter has desirable analytical and computational properties. The estimate of the signal value is obtained at the unique minimum of the a posteriori log likelihood function. This function is convex so that the output of the filter can be easily computed by using either digital or analog computational methods. The effects of the various parameters of the model will be discussed, and the choice of the predetection order statistic filter will also be examined. Example outputs under various noise conditions will be given.     

The problem of demodulating across argument and literal boundaries

This article is the twenty-fourth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find an appropriate theory for modulating across argument and across literal boundaries. Because demodulation has proved so useful—is most cases, even crucial—to automated reasoning, extending this concept to permit canonicalization to be applied at the predicate and at the clause and subclause levels merits exploration. For evaluating a proposed solution to this research problem, we suggest problems from mathematics, logic, program verification, database inquiry, and the world of puzzles.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

Metaheuristic downhill simplex method in combinatorial optimization

The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP). An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented. The study was supported by INTAS (Project 06-1000017-8909). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007.     

Multicast key distribution schemes based on Stinson-Van Trung designs

The efficiency characteristics of multicast key distribution schemes based on (v, b, r, λ)-designs are investigated. The stability and connectivity of such designs are estimated. These estimates generalize and enhance the well-known estimates for the efficiency characteristics of multicast key distribution schemes based on incomplete block designs. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 100–111, May–June 2007.     

Nonlinear suboptimal filtration of pseudorandom sequences

The critical importance of studies of alternative methods of representation and processing of signals constructed from pseudorandom sequences of maximal period is demonstrated. For the first time, it is proposed that a multidimensional nonlinear finite-difference representation of an arbitrary pseudorandom sequence be employed. A suboptimal algorithm for nonlinear discrete Kalman filtration of a pseudorandom sequence is obtained. A numerical example of filtration of a sequence formed on the basis of a given recurrence rule is considered and its efficiency is demonstrated.     

Mathematical modeling and optimization of intratumor drug transport

A pseudohyperbolic problem of optimal control of intratumoral drug distribution is formulated. It takes into account the heterogeneity of tumor tissues and effects of convection diffusion in a fissured porous medium. A mathematical model constructed and the corresponding optimal control problem are shown to be correct. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 147–154, November–December 2007.     

Author's reply to “Comments on ‘Performance evaluation of UKF-based nonlinear filtering”’

It is stated in the above-mentioned comment that the main result of the paper Xiong, Zhang, et al. [(2006). Performance evaluation of UKF-based nonlinear filtering. Automatica 42(2), 261-270] can be extended to a class of filters, such as the extended Kalman filter (EKF). As we show here, this belief can be justified in a rigorous way, even for the nonlinear stochastic system with a nonlinear measurement equation.     

《中华人民共和国煤炭法》亟待修订

当前,由于《煤炭法》颁布的时代背景发生很大变化,该法已经不能适应形势发展和实际工作的需要。该法存在的主要问题包括煤炭开采市场准入门槛设置过低、对煤炭生产开发规划规定过分原则等。我们应以科学发展观为指导,按照市场经济规律的要求,针对存在的问题尽快对《煤炭法》进行修订和完善。     

Smaller superconcentrators of density 28

An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. Here it is proved that such superconcentrators exist (by a random construction of certain expander graphs as building blocks) having density 28 (where the density is the number of edges divided by N). The best known density before this paper was 34.2 [U. Schöning, Construction of expanders and superconcentrators using Kolmogorov complexity, J. Random Structures Algorithms 17 (2000) 64-77] or 33 [L.A. Bassalygo, Personal communication, 2004].